Halting problem

Results: 106



#Item
41Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed]

Looking for Busy Beavers. A socio-philosophical study of a computer-assisted proof. Liesbeth De Mol∗ [removed]

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2011-11-29 04:50:50
42La d´ecouverte de la calculabilit´e L. De Mol Generating, solving and the mathematics of Homo Sapiens.

La d´ecouverte de la calculabilit´e L. De Mol Generating, solving and the mathematics of Homo Sapiens.

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2011-11-23 05:32:01
43cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008

cSplash, Event for High School Students, Courant Institute What is the Numerical Halting Problem? Chee Yap Computer Science Dept, Courant, NYU Mar 29, 2008

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-02-22 12:21:24
44Generating, solving and the mathematics of Homo Sapiens. Emil Post’s views on computation Liesbeth De Mol∗ [removed] “For if symbolic logic has failed to give wings to mathematicians this study of

Generating, solving and the mathematics of Homo Sapiens. Emil Post’s views on computation Liesbeth De Mol∗ [removed] “For if symbolic logic has failed to give wings to mathematicians this study of

Add to Reading List

Source URL: logica.ugent.be

Language: English - Date: 2011-11-29 04:43:49
45arXiv:1312.4455v1 [quant-ph] 16 Dec[removed]The Universe as Quantum Computer Seth Lloyd Department of Mechanical Engineering Massachusetts Institute of Technology

arXiv:1312.4455v1 [quant-ph] 16 Dec[removed]The Universe as Quantum Computer Seth Lloyd Department of Mechanical Engineering Massachusetts Institute of Technology

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-12-16 20:26:09
46Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic

Fundamentals of Computing Leonid A. Levin These are notes for the course CS-172 I first taught in the Fall 1986 at UC Berkeley and subsequently at Boston University. The goal was to introduce the undergraduates to basic

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2015-03-30 07:56:29
47Two fundamental problems connected with AI Abstract This paper is about two fundamental problems in the field of computer science. Solving these two problems is important because it has to do with the creation of Artific

Two fundamental problems connected with AI Abstract This paper is about two fundamental problems in the field of computer science. Solving these two problems is important because it has to do with the creation of Artific

Add to Reading List

Source URL: www.dobrev.com

Language: English - Date: 2007-04-22 07:35:32
48CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa

CAN A TURING PLAYER IDENTIFY ITSELF? DAVID K. LEVINE AND AND BALÁZS SZENTES A BSTRACT. We show that the problem of whether two Turing Machines are functionally equivalent is undecidable and explain why this is significa

Add to Reading List

Source URL: levine.sscnet.ucla.edu

Language: English - Date: 2006-03-16 11:03:47
49A MECHANICAL PROOF OF THE UNSOLVABILITY OF THE HALTING PROBLEM Robert S. Boyer and J Strother Moore ICSCA-CMP-28 July 1982

A MECHANICAL PROOF OF THE UNSOLVABILITY OF THE HALTING PROBLEM Robert S. Boyer and J Strother Moore ICSCA-CMP-28 July 1982

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2000-04-02 13:39:25
50Asia Pacific Mathematics Newsletter January[removed]Volume 2 Number 1

Asia Pacific Mathematics Newsletter January[removed]Volume 2 Number 1

Add to Reading List

Source URL: www.austms.org.au

Language: English - Date: 2012-07-31 22:40:14